Interactive segmentation of image volumes with Live Surface

نویسندگان

  • Christopher J. Armstrong
  • Brian L. Price
  • William A. Barrett
چکیده

Live Surface allows users to segment and render complex surfaces from 3D image volumes at interactive (sub-second) rates using a novel, cascading graph cut (CGC). Live Surface consists of two phases. (1) Preprocessing for generation of a complete 3D hierarchy of tobogganed regions followed by tracking of all region surfaces. (2) User interaction in which, with each mouse movement, the volume is segmented and the 3D object is rendered at interactive rates. Interactive segmentation is accomplished by cascading through the 3D hierarchy from the top, applying graph cut successively, at each level, only to regions bordering the segmented surface from the previous level. CGC allows the entire image volume to be segmented an order of magnitude faster than existing techniques that make use of graph cut. OpenGL rendering provides for display and update of the segmented surface at interactive rates. The user selects objects by tagging voxels with either foreground (object) or background seeds. Seeds can be placed on image cross-sections or directly on the 3D rendered surface. Interaction with the rendered surface improves the user’s ability to steer the segmentation, augmenting or subtracting from the current selection. Segmentation and rendering, combined, is accomplished in about 0.35 seconds, allowing 3D surfaces to be displayed and updated dynamically as each additional seed is deposited. The immediate feedback of Live Surface allows the segmentation of 3D image volumes using an interaction paradigm similar to the Live Wire (Intelligent Scissors) tool used in 2D images.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Live Surface

Live Surface allows users to segment and render complex surfaces from 3D image volumes at interactive (subsecond) rates using a novel, cascading graph cut (CGC). The process consists of four steps. (1) Preprocessing for generation of a complete 3D watershed hierarchy followed by tracking of all catchment basin surfaces. (2) User selection of foreground and background seeds from two-dimensional,...

متن کامل

Live Mesh: an Interactive 3d Image Segmentation Tool

Image segmentation is the process by which objects are extracted from their surroundings in images. Segmentation in two dimensional images is a well-researched area, with both user-interactive and non-user-interactive tools to perform this function. While research has been done in three-dimensional image segmentation, few user-interactive tools exist that work directly in 3D. We present Live Me...

متن کامل

Live-Wire Revisited

The live-wire approach is an interactive, contour-based segmentation technique. Generally, the contour of a targeted object (anatomical structure) is built by interactively selecting control points and finding minimal-cost paths between them. By its very nature, this method is applicable only to 2D images. For the segmentation of 3D datasets (volumes), the interactive generation of live-wire co...

متن کامل

Enhanced lane: interactive image segmentation by incremental path map construction

Live-wire type techniques for interactive image segmentation are of practical use for various applications such as medical image analysis, digital image composition, etc. Intelligent scissors [5] and live wire [8] are the representative techniques of this type, which are based on a graph search over an entire image. Another technique called live lane [8] is also based on a graph search but loca...

متن کامل

Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation

Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2007